Computational complexity theory

Results: 2049



#Item
121Computational complexity theory / Mathematics / Theory of computation / NP-complete problems / Operations research / Set cover problem / Approximation algorithm / Facility location problem / Dominating set / Combinatorial optimization / Reduction / Algorithm

Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen  Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218

Add to Reading List

Source URL: www.cs.tufts.edu

Language: English - Date: 2012-10-31 09:54:20
122Computational complexity theory / Theory of computation / Analysis of algorithms / Order theory / Parameterized complexity / NP / Exponential time hypothesis / Randomized algorithm / Time complexity / Partially ordered set / Order dimension

Chain minors are FPT Jaroslaw Blasiok1 and Marcin Kami´ nski2 1 Instytut Informatyki

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English
123Mathematics / Computational complexity theory / Primality tests / Finite fields / Polynomials / Combinatorial optimization / Matching / Algorithm / Euclidean algorithm / PP / MillerRabin primality test / XC

DIMACS Technical ReportJuly 1995 A Formal Framework for Evaluating Heuristic Programs 1 by

Add to Reading List

Source URL: www.cs.tufts.edu

Language: English - Date: 2012-10-31 09:54:25
124Graph theory / Computational complexity theory / Mathematics / NP-complete problems / Clique problem / Planted clique / Graph partition / Graph coloring / Clique / Time complexity / Maximal independent set / Pathwidth

CS264: Beyond Worst-Case Analysis Lecture #10: Planted and Semi-Random Graph Models∗ Tim Roughgarden† October 22,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2015-01-05 12:59:35
125Theoretical computer science / Theory of computation / Computational complexity theory / Quantum algorithms / Quantum computing / Models of computation / Decision tree model / Quantum phase estimation algorithm / PP / Quantum walk / Time complexity / Quantum information

Can Quantum Search Accelerate Evolutionary Algorithms? Daniel Johannsen Max Planck Institute for Informatics Department of Algorithms and Complexity Saarbrücken, Germany

Add to Reading List

Source URL: www.cse.iitk.ac.in

Language: English - Date: 2016-07-30 09:35:21
126Graph theory / Computational complexity theory / Mathematics / NP-complete problems / Vertex cover / Clique / Degree / Connectivity / Independent set / Graph coloring

Microsoft Wordtext.nativedoc

Add to Reading List

Source URL: web.uvic.ca

Language: English - Date: 2012-11-03 03:43:42
127Computer science / Mathematics / Computational complexity theory / Analysis of algorithms / Combinatorial optimization / Theoretical computer science / Parametric search / Computational geometry / Algorithm / Time complexity / Selection algorithm / Bounding sphere

Algorithmic Techniques for Geometric Optimization? Pankaj K. Agarwal1 and Micha Sharir2;3 1 Department of Computer Science Box 90129, Duke University, Durham, NC, USA.

Add to Reading List

Source URL: www.math.tau.ac.il

Language: English - Date: 2012-06-29 03:18:26
128Computational complexity theory / Theory of computation / Mathematics / Complexity classes / Analysis of algorithms / Graph coloring / Theoretical computer science / Algorithm / NP / Time complexity / Greedy algorithm / P

fea-mcgeoch.qxp:58 AM

Add to Reading List

Source URL: www.ams.org

Language: English - Date: 2001-02-16 13:50:35
129Mathematics / Computational complexity theory / Graph theory / NP-complete problems / Operations research / Travelling salesman problem / Theoretical computer science / Approximation algorithm / Steiner tree problem / Greedy algorithm / Optimization problem / Set cover problem

CS261: Exercise Set #8 For the week of February 22–26, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-02-26 12:53:21
130Computational complexity theory / Mathematics / Operations research / Algebra / Linear algebra / Linear complementarity problem / Mathematical optimization / Linear programming / NP / Inequality / Time complexity / LCP array

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Sparse Linear Complementarity Problems Hanna SUMITA, Naonori KAKIMURA, and

Add to Reading List

Source URL: www.keisu.t.u-tokyo.ac.jp

Language: English - Date: 2013-01-25 04:57:12
UPDATE